Typability in Partial Applicative Structures
نویسندگان
چکیده
Adapting a claim of Kracht (Theor Comput Sci 354:131–141, 2006), we establish a characterization of the typable partial applicative structures.
منابع مشابه
Frege Structures for Partial Applicative Theories
Due to strictness problems, usually the syntactical definition of Frege structures is conceived as a truth theory for total applicative theories. To investigate Frege structures in a partial framework we can follow two ways. First, simply by ignoring undefinedness in the truth definition. Second, by introducing of a certain notion of pointer. Both approaches are compatible with the traditional ...
متن کاملPartial Combinatory Algebras of Functions
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results i...
متن کاملMl-style Typing, Lambda Lifting, and Partial Evaluation
Lambda lifting transforms local function deenitions in functional programming languages into global ones to facilitate their eecient implementation. When considered as a source-to-source transformation for an ML-style typed language, all published algorithms for lambda lifting break typability. We break down two representative lambda lifting algorithms into four elementary transformation steps,...
متن کاملEffective Applicative Structures
An Effective Applicative Structure is a collection of partial functions over an arbitrary set M, indexed by elements of the same set, closed under composition, and containing projections, universal functions and functions S n of the s-m-n theorem of Recursion Theory. The notion of EAS is developed as an abstract approach to computability, filling a notational gap between functional and combinat...
متن کاملOn Completability of Partial Combinatory Algebras
A Partial Combinatory Algebra is completable if it can be extended to a total one. Klop [11, 12] gave a sufficient condition for completability of a PCA M = (M, ·,K, S) in the form of ten axioms (inequalities) on terms of M . We prove that Klop’s sufficient condition is equivalent to the existence of an injective s-m-n function over M (that in turns is equivalent to the Padding Lemma). This is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Logic, Language and Information
دوره 20 شماره
صفحات -
تاریخ انتشار 2011